Constraint programming for reduction of system test-configuration-matrix complexity

ABSTRACT

A system for creating a system configuration data set includes an input operable to receive a set of system properties with attributes and values and a set of expressions representing a set of system test goals. The system further includes a processor operable to define a hierarchical tree structure with a plurality of nodes where each node represents one of the system properties and includes at least one of the attributes and the values and an output operable to output a set of system test data utilizing the hierarchical tree structure combined with the expressions. A method includes creating a hierarchical tree structure with a plurality of nodes where each node represents a system property. The method further includes receiving a set of expressions representing a set of system test goals and creating a set of system test data utilizing the hierarchical tree structure combined with the expressions.

FIELD OF THE INVENTION

The present invention relates generally to testing, and, in particular,to automatically generating a best-effort minimal set of system testconfigurations for highly-configurable systems.

BACKGROUND OF THE INVENTION

Function Test teams are tasked with the validation of a set of featuresand functions in a system or application. This validation is acomprehensive exercise that demonstrates quality at a feature/functionallevel in accordance with specifications and requirements placed on thesystem. Specifically, system testing is used to assess the overallquality of the code from the perspective of the customer.

Testing, such as unit testing, integration testing, system testing,conformance testing, and others is conducted on a complete integratedsystem to evaluate the entire system's compliance with its specifiedrequirements. This type of testing therefore evaluates the interactionsof the various functions in the environment specified in therequirements. System testing is conducted in an environment thatattempts to model as realistically as possible scenarios of customerusage. These scenarios are largely based on the quantitative knowledgeof domain experts within the test team, as well as continuously gatheredinformation from reported customer experiences with the product.

Function and System Testing is performed on systems that exhibitfunctional and nonfunctional decisions. For example, consider the table100 shown in FIG. 1. Table 100 describes examples of supportednonfunctional requirements for Lotus Workplace 3.0 system. Thepermutations and combinations of systems that can be built around thislist are almost endless. Therefore, decisions need to be made prior totesting as to the number of configurations that will be tested (forschedule and resource reasons) whilst at the same time providing asbroad a coverage as possible. This determination typically results insome kind of configuration matrix that captures the systems that testteams build and that includes the heterogeneity required to cover a setof nonfunctional attributes.

Typically, configuration plans are built manually and coordinated by asingle person. FIG. 2 is an example of a configuration matrix 200created manually using Lotus. The effort requires multiple passes withmany subject matter contributors contributing their own coveragerequirements. Once aggregated in a central place, a series of systematicpass-throughs is performed (manually) to change decisions made atvarious points with a view to ensuring as much heterogeneity andcoverage in the decisions made.

This method is time consuming, expensive, tedious, imperfect, and proneto errors. Therefore a need exists to overcome the problems with theprior art as discussed above.

SUMMARY OF THE INVENTION

The invention, according to an embodiment, includes a method of creatinga system configuration data set, where the method comprises creating ahierarchical tree structure with a plurality of nodes where each noderepresents a system property and includes at least one of an attributeand a value. The method further comprises receiving a set of expressionsrepresenting a set of system test goals and creating a set of systemtest data utilizing the hierarchical tree structure combined with theexpressions.

According to an additional feature of the present invention, theexpressions are first-order logic expressions that define conditionaland quantified goals of a system.

According to yet another feature, the present invention includesselecting at least one of the attribute, the value, and the expressionso as to further define at least one of the set of system test goals.

According to still another feature of the present invention, the set ofexpressions includes at least one preference expression that defines atleast one of testing knowledge, testing experience, and testing beliefs.

According to a further feature, embodiments of the present inventioninclude associating a bias value to the at least one preferenceexpression and associating a priority value to the at least onepreference expression.

The present invention, according to one embodiment, includes a systemfor performing event analysis, where the system comprises an inputoperable to receive a set of system properties with attributes andvalues and a set of expressions representing a set of system test goals.The system also includes a processor operable to define a hierarchicaltree structure with a plurality of nodes where each node represents oneof the system properties and includes at least one of the attributes andthe values and an output operable to output a set of system test datautilizing the hierarchical tree structure combined with the expressions.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying figures, where like reference numerals refer toidentical or functionally similar elements throughout the separate viewsand which together with the detailed description below are incorporatedin and form part of the specification, serve to further illustratevarious embodiments and to explain various principles and advantages allin accordance with the present invention.

FIG. 1 is an exemplary table of supported nonfunctional requirements.

FIG. 2 is an exemplary manually created configuration matrix.

FIG. 3 illustrates a system test configuration process in accordance toan embodiment of the present invention.

FIG. 4 illustrates a hierarchical configuration model in accordance toan embodiment of the present invention.

FIG. 5 shows a test suite computation process of Layer 1 in accordanceto an embodiment of the present invention.

FIG. 6 shows a preference expression process of Layer 2 in accordancewith an embodiment of the present invention.

FIG. 7 is a block diagram of an exemplary computer system useful forimplementing the present invention.

DETAILED DESCRIPTION

While the specification concludes with claims defining the features ofthe invention that are regarded as novel, it is believed that theinvention will be better understood from a consideration of thefollowing description in conjunction with the drawing figures, in whichlike reference numerals are carried forward.

Described now is an exemplary method and hardware platform forautomatically generating a minimal set of test configurations forhighly-configurable systems (e.g., operating systems, databases, andmiddlewares), which meet predefined testing goals. It should be notedthat the invention described herein follows a best-effort approach tocompute a “minimal” set of system test configurations. It does NOTguarantee that the minimum set is always computed. Therefore, the term“minimal” is used throughout to description to represent a best-effortapproach to finding a minimum-numbered set. The invention is not to belimited to an actual mathematical minimum. Highly-configurable systemshave options and settings. However, it is usually the case that not allconfigurations are valid, i.e. there are constraints on what option andsetting configurations will work. For instance, MS Internet Explorerdoes not work on Linux. In addition, the components themselves haveoptions and settings. For example, the amount of free memory, the sizeof a cache, and others, which can render components non-compatible.

As an improvement over the state of the art techniques, an embodiment ofthe present invention allows testing goals to be specified in terms ofcomplex first-order logic expressions, each of which is associated witha bias and priority parameter. In addition, the present inventiondevelops a set of system configurations that meet these test goals,while also satisfying all of the constraints in the configuration model.Example expressions for test goals include if then, iff (if and onlyif), if and; or; and negate; true; and false.

FIG. 3 illustrates four main steps that are followed by an embodiment ofthe present invention to generate a system test configuration. Each ofthese steps will be defined in greater detail in the paragraphsimmediately below. The flow starts at step 300 and moves directly tostep 301 where solution approach is developed and implemented. Step 301implements the tool that executes the steps 302, 304, and 306. In step302, a configuration model is defined. A set of testing goals for themodel are specified in step 304. Step 302 and 304 represent the step inwhich the end user provides inputs to the tool. The tool thenautomatically generates the test suites for the given input in step 306.The flow ends at step 308. A more detailed explanation is now provided.

Implementing the Solution Approach

One implementation of the present invention is realized by leveragingconstraint logic programming (CLP) techniques. With this technique, eachrequirement and preference expression, as well as each constraintdefined in the configuration model, is mapped into a constraint handlingrule (CHR). These rules are called requirement, preference, andconstraint CHR rules, respectively.

A relatively small system core is then used to compute a minimal testsuite by processing these CHR rules. This core itself consists of CHRrules as well as some auxiliary methods (e.g., methods for computing thecombined rankings of configurations and methods for sorting sets andlists). There are two kinds of core CHR rules: domain-specific CHR rulesand solution-specific CHR rules. Domain-specific CHR rules define thesemantics of the basic constructs of the domain of the presentinvention. These basic constructs include configuration options andtheir settings, configurations, valid configurations, test suitetemplates, and test suites. For example, the domain-specific CHR rulesfor configuration options force each configuration option to take avalue only from its discrete set of settings and the CHR rules for validconfigurations force that a valid configuration consists ofconfiguration options, each of which is assigned to one of its validsettings such that no inter-option constraint defined in theconfiguration model is violated.

Solution-specific CHR rules define both the semantics and the scope ofthe requirement, preference, and constraint CHR rules. For example,these rules enforce constraint and preference CHR rules at theconfiguration level and the requirement constraints at the test suitelevel. Solution-specific CHR rules also define the semantics andconnectivity of the layers described above.

Modeling Configuration Spaces

According to particular embodiments of the present invention, softwareconfiguration spaces are formally modeled using a construct called a“configuration model.” A configuration model defines a validconfiguration space for the system under test (SUT). A basic buildingblock of this configuration model is “options,” which are attributes ofthe SUT. Each option takes its value from a discrete number of settings.A configuration is then defined as a set of options, each of which isassigned to one of its valid settings. In practice, not allconfigurations are valid since there may be some inter-optionconstraints. A valid configuration is one that does not violate anyinter-option constraints.

A distinguishing feature of this inventive configuration model is itshierarchical structure, which will be described and shown in detailbelow. This hierarchical structure is an improvement over the currentstate of the art techniques that treat configuration spaces as flatspaces with some limited (if any) abstraction mechanisms. The inventivehierarchical configuration model is able to 1) capture the hierarchicalnature of software configuration spaces, 2) promote the reuse andsharing of configuration models within/across groups, teams, andorganizations, and 3) promote the use of efficient constraintsatisfaction mechanisms.

FIG. 4 illustrates the hierarchical nature of the present inventiveconfiguration model over an example. The model includes a plurality ofnodes, each representing a system property. Two types of nodes exist inthe configuration model 400: value and option nodes. Option nodes(ovals) and value nodes (rectangles) represent the configuration optionsand their settings, respectively. A configuration model tree is validiff 1) it is a tree, 2) each level of the tree consists of nodes of thesame type, 3) the root is a value node, and 4) the tree consists oflevels with alternating node types starting from the root.

In the particular example shown in FIG. 4, a system 400 has 3 options:hardware 402, operating system (OS) 404, and browser 406. Each noderepresents either an abstract or a concrete system property. Forinstance, defining the node as a browser is abstract, while defining itas Firefox or Internet Explorer is concrete. Each of these options isconnected to some value nodes that represent its potential settings. Forexample, Windows 408 and Linux 410 are two possible settings for theoption OS 404. Assuming that OS=Windows, there are several options(i.e., opt-1 . . . opt-n) that can be configured. Each option can bethought of as an attribute and each will have a value. Navigation isperformed over the tree using the well-known (.) notation e.g.,system.OS.Windows.opt-1=val-1. The rational behind the configurationmodel is that the setting (value) of an option in a component and/orsystem could correspond to a subcomponent with a complex configurationmodel.

In a configuration model, each non-leaf value node is associated with aset of inter-option constraints. A constraint is a first-order logic(FOL) expression. “True” and “false” are supported as default constants.For example, the constraint A=0 and B=0→C=1 means that in aconfiguration, if A is 0 and B is 0, then C has to be 1.

In a constraint, according to an embodiment of the present invention,each value node can only refer to options and their settings to which itis the parent/ancestor of. The cumulative set of constraints for a valuenode is the union of all constraints associated with value nodes whichthe node is the parent/ancestor of. For example, in the system node 400,the following constraint applies: system.os=Linux→system.browser !=MSIE,meaning that if the OS is Linux, the browser cannot be MicrosoftInternet Explorer.

With a hierarchical configuration model, the present invention is ableto capture the hierarchical nature of software configuration spaces andpromote the reuse and sharing of configuration models within and acrossgroups, teams, and organizations. For example, configuration models ofsubcomponents (i.e., suitable sub-trees) can be located at a site thatvarious groups have access to and can be reused, extended, modified, andtailored according to application specific needs. The present inventionis also able to promote the use of efficient constraint satisfactionmechanisms e.g., rather than satisfying all the constraints at once, onecan consider satisfying only small and relevant portions of theconstraints at each level of the tree at a time. In addition, thehierarchical configuration model allows the present invention to preventname clashes by forcing a hierarchical naming scheme.

Specifying Testing Goals

Testers, according to an embodiment of the present invention, specifythe goal of testing in terms of options and their settings. Given aconfiguration model and a goal specification, the present invention, asshown in step 304 of FIG. 3, is able to compute a minimal test suite ofvalid configurations that satisfies the goal.

One novel feature of the present invention is that test suites aregenerated that have configurations with potentially different quantitiesof options as well as with different sets of options. This is madepossible by the hierarchical modeling of the configuration space.Current state-of-the-art techniques can only generate a set ofconfigurations, each of which has exactly the same set of options (e.g.,Test Optimizer for Functional Usage and Automated Efficient TestGenerator).

After the configuration model is constructed, first-order logicexpressions are leveraged to specify one or more testing goals. Twotypes of goal expressions are used here: requirement and preferenceexpressions. Requirement expressions specify what needs to be tested(i.e., combinations of option settings to be tested). Preferenceexpressions capture the tester's belief (e.g., some combinations arefrequently used in the field), knowledge (e.g., some combinations aremore expensive to configure compared to others), and experience (e.g.,certain combinations do not really matters). Both requirement andpreference expressions are associated with a bias and priorityparameter, capturing the tester's bias and priority in the testingprocess, respectively.

A requirement expression is, according to embodiments of the presentinvention, in the form of true→<a FOL expression>. The left-hand side ofa requirement specification is always true, meaning that therequirements must be satisfied with the generated test suite. Unlike theinter-option constraints, requirement expressions are satisfied at thetest suite level, not at the configuration level. For example, therequirement expression true→A=0 and B=0 indicates that the tester wantsto see at least one configuration where A is 0 and B is 0. Requirementsexpressions are used to compute the skeleton (template) of the testsuite. It should be noted that a graphical user interface (GUI) can beused to flatten out more complex constraints into a set of requirementexpressions. For example, a requirement of covering all 2-way (n-way, ingeneral) interactions between k options can be represented as a set ofrequirement expressions.

A preference expression can be any first-order logic expression. Forexample, the preference expression OS=Windows andBrowser=MSIE→MSIE.opt1=val1 and MSIE.opt2=val2 indicates the tester'sintention that if the OS is Windows and browser is MSIE, then it isdesirable to configure the MSIE in a certain way. Preference expressionsare intended to be satisfied after all the requirement expressions aresatisfied, i.e., after the skeleton/template of the test suite iscomputed. Preference expressions are neither destructive (i.e., they donot modify the settings of already set options) nor constructive (i.e.,they do not change the size of the test suite). They are used to assignvalues to the options that aren't touched by the requirement expressionsin a way that reflects the tester's belief (e.g., some combinations arefrequently used in the field), knowledge (e.g., some combinations aremore expensive to configure compared to others), and experience (e.g.,certain combinations do not really matters). The present invention,according to certain embodiments, follows a best-effort approach tosatisfy as many preference expressions as possible.

Each requirement, as well as each preference expression, is associatedwith two parameters: bias (0≦bias≦1) and priority (a positive number).The values of these parameters are assigned by the tester during thecreation of the expressions and can later be modified to meet therequirements of evolving testing goals. The bias parameter is used tocapture the tester's bias towards satisfying the associated expression.For example, given the preference expression A=0 and B=0→C=and D=1 witha bias=0.8, for each configuration in the current test suite templatewhich satisfies the left-hand side of the expression (in this case A=0and B=0), a biased coin is flipped and the decision whether to satisfythe expression or not is made depending on the outcome. One exception isthat requirement expressions are always satisfied at least once,regardless of the bias parameter. Of course, an actual coin is notflipped to make this determination. The reference to coin is for ease ofdiscussion and an actual coin flip can be replaced with many computeralgorithms for computing probability.

The priority parameter is used to capture the tester's priorities. Thisparameter takes a positive number. The larger the number, the higher thepriority is. Of course, the invention is not limited to this particularpriority number scheme. In other embodiments, the lower number couldindicate a higher priority. The actual semantics of this parameterdepends on the context. In requirement expressions, priorities impose anorder on the set of configurations generated; the generatedconfigurations are ordered in a descending order according to theircombined priority rankings (The following section provides a moredetailed discussion on how to compute combined priority rankings). Inpreference expressions, priorities determine the order in which thepreference expressions are processed. Preference expressions are orderedin descending order according to their priority rankings and expressionswith higher ratings are given priority over the expressions with lowerratings.

Generating Test Suites

Now that a configuration model and a goal specification have beendetermined, a minimal test suite that satisfies the goal specificationcan be computed. To this end, embodiments of the present provide amulti-layered approach to reach this goal. A few goals of the inventivemulti-layered approach are to: 1) scale the solution to larger, morecomplex configuration spaces by dividing the goal specification into aset of related sub-goal specifications each of which constitutes alayer, 2) employ the best techniques/strategies at each layer to satisfythe associated set of sub-goals, and 3) allow the solution approach tobe tailored towards application/organization-specific needs.

One embodiment of the present invention includes four layers, layers 1,2, 3, and 4. Layers 1, 2, 3, and 4 deal with the requirementexpressions, preference expressions, partial configurations, andpriorities, respectively.

Layer 1:

Layer 1 is concerned with the requirement expressions. In this layer,the requirement expressions are taken as inputs and a minimal test suitetemplate is computed that satisfies all the requirement expressions aslong as they are not conflicting with the constraints given in theconfiguration model. A test suite template consists of a set ofpartially filled configurations.

FIG. 5 shows the Layer 1 test suite computation process according to anembodiment of the present invention. The flow begins at step 500 andmoves directly to step 502, where a new configuration is added to anempty test suite, by employing what can be referred to as a “greedy”approach. That is, a requirement expression is randomly picked from agiven set of requirement expressions. In one embodiment, a randomselection-without-replacement approach is followed here, i.e., eachexpression is selected only once. Next, step 504, the current test suiteis traversed starting from the top to find a configuration that canaccommodate the combination of option settings indicated by therequirement expression chosen in step 502. A configuration canaccommodate a combination of option settings iff 1) the combination doesnot conflict with the current settings of the options present in theconfiguration and 2) the new configuration obtained after accommodatingthe combination does not conflict with the constraints given in theconfiguration model.

In step 506 a determination is made as to whether the configuration canaccommodate such combinations. If such a configuration is found, step508, then the combination is accommodated in the configuration.Otherwise, step 510 a new configuration which contains only the requiredcombination is created and added to the suite. The determination is thenmade in step 512 as to whether or not each and every requirementexpression has been exercised. Example expressions for test goalsinclude if then, iff (if and only if), if and; or; and negate; true; andfalse. If the answer is no, the flow returns to step 502 where anotherrequirement expression is randomly picked from the remaining set ofrequirement expressions. If all requirement expressions have beensatisfied at least once, the flow moves to step 514 where the biases arehandled.

Starting at step 514, the current test suite template is traversed. Foreach configuration in the template and for each requirement expressionwith a bias b that is not conflicting with the currently selectedconfiguration, a biased coin is flipped in step 516. The coin has aprobability p(b) of heads. If the outcome is heads, the combinationindicated by the requirement expression is accommodated in the currentconfiguration in step 518. At layer 1, the test suite contains onlypartially filled configurations. That is, each configuration in thesuite may have some options whose values have not been set yet. The term“accommodating a combination in a configuration,” means setting theoptions of the configuration which have not been set yet with the valuesindicated in the combination. Note that each requirement/preferenceexpression indicates a combination. For example, the expression“true→A=0 and B=1” indicates that the tester wants to see thecombination A=0 and B=1 in the test suite. In step 520 a determinationis made as to whether there is another configuration in the templatethat has not been checked. If there is another configuration, the flowreturns to step 514 with the next configuration in the template. If instep 517, it is determined that the outcome is tails, the flow alsomoves to step 520. If there are no other configurations, the flow movesto step 522 and ends.

Layer 2:

Layer 2 is concerned with the preference expressions. The process flowof layer 2 is shown in FIG. 6. The flow begins at step 600 and movesdirectly to step 602, where the preference expressions are sorted indescending order according to their priority rankings. Preferenceexpressions with higher rankings are given priority over the preferenceswith lower rankings. Starting with the highest priority preferenceexpression, all configurations in the current test suite template thatsatisfy the left-hand side of the expression and that do not conflictwith the preference expression are found in step 604. The samplepreference expression A=0 and B=0→C=1 and D=1 with a bias b can be usedto explain this layer. In this expression, A=0 and B=0 constitute theleft-hand side (1 hs) of the expression and C=1 and D=1 constitute theright-hand side (rhs) of the expression.

For each such configuration, a biased coin with probability p(b) ofheads is flipped in step 606. The expression is satisfied depending onthe outcome of step 606. If the outcome is heads, the combination isaccommodated in step 608; otherwise the combination is not accommodatedand the flow moves to step 610 to determine if there is a change in thetest suite template. If there is a change, the flow moves back up tostep 605, where the current test suite is traversed. Otherwise, the flowmoves to step 612 and ends.

Layer 3:

Layer 3 is concerned with partial configurations. As described above,the result of Layer 2 is a test suite template that satisfies therequirement expressions and as many preference expressions as possible.In this template, it is possible to have configurations with someconfiguration options that are not yet set. This can be the case whenrequirement and preference expressions are concerned with only a portionof the options. In Layer 3, the test suite template is converted to aconcrete test suite by assigning values to untouched options in such away that no configuration in the resulting suite conflicts with theconstraints defined in the configuration model.

Layer 4:

Layer 4 is concerned with the priorities of the requirement expressions.Layer 3 emits a test suite and Layer 4 reorders this suite according tothe combined priority ranking of each configuration. As discussed above,each requirement expression is associated with a positive priorityvalue. Each configuration in the resulting test suite can potentiallyaccommodate more than one such combination. Therefore, a combinedpriority ranking is computed for a configuration using the rankings ofcombinations covered by the configuration. The exact formula to do thisis given by the tester. One exemplary way to compute the combinedpriority ranking for a configuration is to multiply all the prioritiesof combinations accommodated by the configuration. The configurationsare then reordered in descending order according to the combinedpriority rankings.

Generalized Architecture for a Computer System

FIG. 7 is a block diagram of a computer system useful for implementingan embodiment of the present invention. The computer system includes oneor more processors, such as processor 704. The processor 704 isconnected to a communication infrastructure 702 (e.g., a communicationsbus, cross-over bar, or network). Various software embodiments aredescribed in terms of this exemplary computer system. After reading thisdescription, it will become apparent to a person of ordinary skill inthe relevant art(s) how to implement the invention using other computersystems and/or computer architectures.

The computer system can include a display interface 708 that forwardsgraphics, text, and other data from the communication infrastructure 702(or from a frame buffer not shown) for display on the display unit 710.The computer system also includes a main memory 706, preferably randomaccess memory (RAM), and may also include a secondary memory 712. Thesecondary memory 712 may include, for example, a hard disk drive 714and/or a removable storage drive 716, representing a floppy disk drive,a magnetic tape drive, an optical disk drive, etc. Removable storagedrive 716, reads and writes to a floppy disk, magnetic tape, opticaldisk, etc., storing computer software and/or data. The system alsoincludes a resource table 718, for managing resources R₁-R_(n) such asdisk drives, disk arrays, tape drives, CPUs, memory, wired and wirelesscommunication interfaces, displays and display interfaces, including allresources shown in FIG. 7, as well as others not shown.

In alternative embodiments, the secondary memory 712 may include othersimilar means for allowing computer programs or other instructions to beloaded into the computer system. Such means may include, for example, aremovable storage unit 722 and an interface 720. Examples of such mayinclude a program cartridge and cartridge interface (such as that foundin video game devices), a removable memory chip (such as an EPROM, orPROM) and associated socket, and other removable storage units 722 andinterfaces 720 which allow software and data to be transferred from theremovable storage unit 722 to the computer system.

The computer system may also include a communications interface 724.Communications interface 724 acts as both an input and an output andallows software and data to be transferred between the computer systemand external devices. Examples of communications interface 724 mayinclude a modem, a network interface (such as an Ethernet card), acommunications port, a PCMCIA slot and card, etc. Software and datatransferred via communications interface 724 are in the form of signalswhich may be, for example, electronic, electromagnetic, optical, orother signals capable of being received by communications interface 724.These signals are provided to communications interface 724 via acommunications path (i.e., channel) 726. This channel 726 carriessignals and may be implemented using wire or cable, fiber optics, aphone line, a cellular phone link, an RF link, and/or othercommunications channels.

In this document, the terms “computer program medium,” “computer usablemedium,” and “computer readable medium” are used to generally refer tomedia such as main memory 706 and secondary memory 712, removablestorage drive 716, a hard disk installed in hard disk drive 714, andsignals. These computer program products are means for providingsoftware to the computer system. The computer readable medium allows thecomputer system to read data, instructions, messages or message packets,and other computer readable information from the computer readablemedium. The computer readable medium, for example, may includenon-volatile memory, such as Floppy, ROM, Flash memory, Disk drivememory, CD-ROM, and other permanent storage. It is useful, for example,for transporting information, such as data and computer instructions,between computer systems. Furthermore, the computer readable medium maycomprise computer readable information in a transitory state medium suchas a network link and/or a network interface, including a wired networkor a wireless network, that allow a computer to read such computerreadable information.

Computer programs (also called computer control logic) are stored inmain memory 706 and/or secondary memory 712. Computer programs may alsobe received via communications interface 724. Such computer programs,when executed, enable the computer system to perform the features of thepresent invention as discussed herein. In particular, the computerprograms, when executed, enable the processor 704 to perform thefeatures of the computer system. Accordingly, such computer programsrepresent controllers of the computer system.

Although specific embodiments of the invention have been disclosed,those having ordinary skill in the art will understand that changes canbe made to the specific embodiments without departing from the spiritand scope of the invention. The scope of the invention is not to berestricted, therefore, to the specific embodiments. Furthermore, it isintended that the appended claims cover any and all such applications,modifications, and embodiments within the scope of the presentinvention.

1. A method of creating a system configuration data set, the methodcomprising: creating a hierarchical tree structure with a plurality ofnodes where each node represents a system property and includes at leastone of an attribute and a value; receiving a set of expressionsrepresenting a set of system test goals; and creating a set of systemtest data utilizing the hierarchical tree structure combined with theexpressions.
 2. The method according to claim 1, wherein the expressionsare first-order logic expressions that define conditional and quantifiedgoals of a system.
 3. The method according to claim 1, wherein anexpression includes at least one of: if then; iff; if and; or; andnegate; true; and false.
 4. The method according to claim 1, furthercomprising: selecting at least one of the attribute, the value, and theexpression so as to further define at least one of the set of systemtest goals.
 5. The method according to claim 1, wherein: the set ofexpressions includes at least one preference expression that defines atleast one of testing knowledge, testing experience, and testing beliefs.6. The method according to claim 5, further comprising: associating abias value to the at least one preference expression; and associating apriority value to the at least one preference expression.
 7. The methodaccording to claim 1, further comprising: creating the set of systemtest data by performing pairwise testing on at least three of theplurality of nodes.
 8. The method according to claim 1, wherein: thesystem property is one of abstract and concrete.
 9. A system forperforming event analysis, the system comprising: an input operable toreceive: a set of system properties with attributes and values; and aset of expressions representing a set of system test goals; a processoroperable to define a hierarchical tree structure with a plurality ofnodes where each node represents one of the system properties andincludes at least one of the attributes and the values; and an outputoperable to output a set of system test data utilizing the hierarchicaltree structure combined with the expressions.
 10. The system accordingto claim 9, wherein the expressions include at least one of: if then;iff; if and; or; and negate; true; and false.
 11. The system accordingto claim 9, wherein the input is further operable to: receive aselection of at least one of the attribute, the value, and theexpression so as to further define at least one of the set of systemtest goals.
 12. The system according to claim 9, wherein: the set ofexpressions includes at least one preference expression that defines atleast one of testing knowledge, testing experience, and testing beliefs.13. The system according to claim 12, wherein: the input is furtheroperable to receive at least one bias value and at least one preferencevalue; and the processor is further operable to: associate the at leastone bias value with the at least one preference expression; andassociate the at least one priority value to the at least one preferenceexpression.
 14. A computer program product for creating a systemconfiguration data set, the computer program product comprising: astorage medium readable by a processing circuit and storing instructionsfor execution by the processing circuit for performing a methodcomprising: creating a hierarchical tree structure with a plurality ofnodes where each node represents a system property and includes at leastone of an attribute and a value; receiving a set of expressionsrepresenting a set of system test goals; and creating a set of systemtest data utilizing the hierarchical tree structure combined with theexpressions.
 15. The computer program product according to claim 14,wherein an expression includes at least one of: if then; iff; if and;or; and negate; true; and false.
 16. The computer program productaccording to claim 14, wherein the expressions are first-order logicexpressions that define conditional and quantified goals of a system.17. The computer program product according to claim 14, furthercomprising: selecting at least one of the attribute, the value, and theexpression so as to further define at least one of the set of systemtest goals.
 18. The computer program product according to claim 14,wherein: the set of expressions includes at least one preferenceexpression that defines at least one of testing knowledge, testingexperience, and testing beliefs.
 19. The computer program productaccording to claim 18, further comprising: associating a bias value tothe at least one preference expression; and associating a priority valueto the at least one preference expression.
 20. The computer programproduct according to claim 14, wherein: the system property is one ofabstract and concrete.